WORST_CASE(?,O(n^1))

Solution:
---------

  "f" :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
  "f" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "f" :: ["A"(0) x "A"(11)] -(11)-> "A"(11)
  "g" :: ["A"(15) x "A"(11)] -(13)-> "A"(0)
  "h" :: ["A"(15) x "A"(0)] -(15)-> "A"(15)
  "h" :: ["A"(11) x "A"(0)] -(11)-> "A"(11)
  "h" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)


Cost Free Signatures:
---------------------

  "f" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "g" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "h" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"f\"_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
  "\"h\"_A" :: ["A"(1) x "A"(0)] -(1)-> "A"(1)